A Rapid Algorithm for Topology Construction from a Set of Line Segments
نویسندگان
چکیده
An efficient algorithm for topology construction from a set of line segments is considered in the paper. The algorithm works in two steps: input analyzing, and topology construction. In the first step, inconsistencies in input are solved. The second step consists of two parts: the envelope construction, and determination of neighbouring relations between the obtained neighbouring The time complexity of the first part highly depends on the input data distribution, and the second part, which presents our original work, runs in O(n), what is confirmed by experiments using artificial input and real data from geographic database. Key-Words: Geographic Information System (GIS), Topology Construction, Uniform Plane
منابع مشابه
COMPOSITION OF ISOGEOMETRIC ANALYSIS WITH LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION
In the present paper, an approach is proposed for structural topology optimization based on combination of Radial Basis Function (RBF) Level Set Method (LSM) with Isogeometric Analysis (IGA). The corresponding combined algorithm is detailed. First, in this approach, the discrete problem is formulated in Isogeometric Analysis framework. The objective function based on compliance of particular lo...
متن کاملساخت توپولوژی انرژیآگاه با مکانیزم نگهداری در شبکههای حسگر بیسیم
Wireless sensor networks (WSN) is presented solution for the problem of low-cost and flexible monitoring event, especially in places with limited access or dangerous for humans. Wireless sensor networks are built from wireless devices with limited resources thus to Long-Term survival of the Network must use energy-efficient mechanisms, algorithms and protocols. one of th...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملConstruction of Hexahedral Block Topology and its Decomposition to Generate Initial Tetrahedral Grids for Aerodynamic Applications
Making an initial tetrahedral grid for complex geometry can be a tedious and time consuming task. This paper describes a novel procedure for generation of starting tetrahedral cells using hexahedral block topology. Hexahedral blocks are arranged around an aerodynamic body to form a flow domain. Each of the hexahedral blocks is then decomposed into six tetrahedral elements to obtain an initial t...
متن کامل